A Term Rewriting Technique for Decision Graphs
نویسندگان
چکیده
منابع مشابه
A Term Rewriting Technique for Decision Graphs
We provide an automatic verification for a fragment of FOL quantifier-free logic with zero, successor and equality. We use BDD representation of such formulas and to verify them, we first introduce a (complete) term rewrite system to generate an equivalent Ordered (0, S,=)-BDD from any given (0, S,=)-BDD. Having the ordered representation of the BDDs, one can verify the original formula in cons...
متن کاملBi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ −→ and rewriting a to b, we use another rewriting relation ⊇ −→ as well and seek a common expression c such that a ⊆ −→ ∗ c and b ⊇ −→ ∗ c. Each component of the bi-rewriting system 〈 ⊆ −→, ⊇ −→〉 is allowed to be a subset ...
متن کاملA rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules, acting as elaborated abstractions, their application and the obtained structured results are first class objects of the calculus. The evaluation mechanism, generalizing beta-reduction, strongly relies on term matching ...
متن کاملA Verification Technique Using Term Rewriting Systems and Abstract Interpretation
Verifying the safety property of a transition system given by a term rewriting system is an undecidable problem. In this paper, we give an abstraction for the problem which is automatically generated from a given TRS by using abstract interpretation. Then we show that there are some cases in which the problem can be decided. Also we show a new decidable subclass of term rewriting systems which ...
متن کاملUniversit a Di Pisa (cyclic) Term Graph Rewriting Is Adequate for Rational Parallel Term Rewriting (cyclic) Term Graph Rewriting Is Adequate for Rational Parallel Term Rewriting ?
Acyclic Term Graphs are able to represent terms with sharing , and the relationship between Term Graph Rewriting (TGR) and Term Rewrtiting (TR) is now well understood BvEG + 87, HP91]. During the last years, some researchers considered the extension of TGR to possibly cyclic term graphs, which can represent possibly innnite, rational terms. In KKSdV94] the authors formalize the classical relati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.10.016